Number of minimum vertex cuts in transitive graphs
نویسندگان
چکیده
منابع مشابه
On the number of closed walks in vertex-transitive graphs
The results of J. Širáň and the first author (Australasian J. Combin. 10 (1994)) are generalized, and new formulas for the number of closed walks of length p or pq, where p and q are primes, valid for all vertex-transitive graphs are found. Based on these formulas, several simple tests for vertex-transitivity are presented, as well as lower bounds on the orders of the smallest vertexand arc-tra...
متن کاملVertex-transitive CIS graphs
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...
متن کاملCores of Vertex Transitive Graphs
A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and ...
متن کاملLimits of vertex-transitive graphs
The class of all connected vertex-transitive graphs with finite valency forms a metric space under a natural combinatorially defined metric. We prove some basic properties of this metric space and discuss the structure of graphs which are limit points of the subset consisting of all finite graphs that admit a vertex-primitive group of automorphisms. A description of these limit graphs would pro...
متن کاملCompression of Vertex Transitive Graphs
We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V, E) is called vertex transitive if for every pair of vertices x, y ∈ V , there is an automorphism σ of G, such that σ(x) = y. A result due to Sabidussi, guarantees that for every vertex transitive graph G there exists a graph mG (m is a positive integer) which is a Cayley graph. We propose as the compre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00133-x